Algorithm for quadratic semi-assignment problem with partition size coefficients
نویسندگان
چکیده
منابع مشابه
Semi Quadratic Assignment Problem
Changing the QAP's hard definition such that the facilities M are allowed to be mapped by a (single-valued, not necessarily injective) function π into the set of possible locations Y subject to a relation Π, π ⊆ Π, it arises the Semi-QAP that might be regarded as a relaxation of the QAP. In contrast to the Tree-QAP (flow graph F is a tree) the corresponding Semi-Tree-QAP is solvable in polynomi...
متن کاملRobust Quadratic Assignment Problem with Uncertain Locations
We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملa honey bee algorithm to solve quadratic assignment problem
assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. in this study, we solve quadratic assignment problem (qap), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. it should be noted that any facility must be assign to only one location. in this paper, first o...
متن کاملsolving quadratic assignment problem (qap) using invasive weed optimization algorithm
a new powerful optimization algorithm inspired from colonizing weeds is utilized to solve the well-known quadratic assignment problem (qap) which is of application in a large number of practical areas such as plant layout, machinery layout and so on. a set of reference numerical problems from qaplib is taken in order to evaluate the efficiency of the algorithm compared with the previous ones wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2013
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-013-0636-3